Phase Transitions Related to the Pigeonhole Principle
نویسندگان
چکیده
Since Jeff Paris introduced them in the late seventies [Par78], densities turned out to be useful for studying independence results. Motivated by their simplicity and surprising strength we investigate the combinatorial complexity of two such densities which are strongly related to the pigeonhole principle. The aim is to miniaturise Ramsey’s Theorem for 1-tuples. The first principle uses an unlimited amount of colours, whereas the second has a fixed number of two colours. We show that these principles give rise to Ackermannian growth. After parameterising these statements with respect to a function f : N → N, we investigate for which functions f Ackermannian growth is still preserved.
منابع مشابه
An Exponential Separation Between the Parity Principle and the Pigeonhole Principle
The combinatorial parity principle states that there is no perfect matching on an odd number of vertices. This principle generalizes the pigeonhole principle, which states that for a fixed bipartition of the vertices, there is no perfect matching between them. Therefore, it follows from recent lower bounds for the pigeonhole principle that the parity principle requires exponentialsize bounded-d...
متن کاملAn Exponential Separation between the Matching Principle and the Pigeonhole Principle
The combinatorial matching principle states that there is no perfect matching on an odd number of vertices. This principle generalizes the pigeonhole principle, which states that for a fixed bipartition of the vertices, there is no perfect matching between them. Therefore, it follows from recent lower bounds for the pigeonhole principle that the matching principle requires exponential-size boun...
متن کاملThe pigeonhole principle and related counting arguments in weak monotone systems
We construct quasipolynomial-size proofs of the propositional pigeonhole principle for the fragment of the sequent calculus with no cuts between ancestors of left and right negation, weakening and contraction rules. The main construction of our argument, inspired by previous work on the monotone calculus by Atserias et al., provides formal proofs that permute the inputs of formulae computing th...
متن کاملPigeonring: A Principle for Faster Thresholded Similarity Search
The pigeonhole principle states that if n items are contained in m boxes, then at least one box has no more than n/m items. It is utilized to solve many data management problems, especially for thresholded similarity searches. Despite many pigeonhole principle-based solutions proposed in the last few decades, the condition stated by the principle is weak. It only constrains the number of items ...
متن کاملAn Exponential Separation between the Parity Principle andthe
The combinatorial parity principle states that there is no perfect matching on an odd number of vertices. This principle generalizes the pigeonhole principle, which states that for a xed bi-partition of the vertices, there is no perfect matching between them. Therefore, it follows from recent lower bounds for the pigeonhole principle that the parity principle requires exponential-size bounded-d...
متن کامل